Model checking with generalized Rabin and Fin-less automata
نویسندگان
چکیده
منابع مشابه
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
The model-checking problem for probabilistic systems crucially relies on the translation of LTL to deterministic Rabin automata (DRW). Our recent Safraless translation [KE12,GKE12] for the LTL(F,G) fragment produces smaller automata as compared to the traditional approach. In this work, instead of DRW we consider deterministic automata with acceptance condition given as disjunction of generaliz...
متن کاملModel Checking Using Generalized Testing Automata
Geldenhuys and Hansen showed that a kind of ω-automata known as Testing Automata (TA) can, in the case of stuttering-insensitive properties, outperform the Büchi automata traditionally used in the automata-theoretic approach to model checking [10]. In previous work [23], we compared TA against Transition-based Generalized Büchi Automata (TGBA), and concluded that TA were more interesting when c...
متن کاملLarger Automata and Less Work for LTL Model Checking
Many different automata and algorithms have been investigated in the context of automata-theoretic LTL model checking. This article compares the behaviour of two variations on the widely used Büchi automaton, namely (i) a Büchi automaton where states are labelled with atomic propositions and transitions are unlabelled, and (ii) a form of testing automaton that can only observe changes in state ...
متن کاملModel Checking with Fly-Automata
The verification of monadic second-order (MSO) graph properties, equivalently, the model-checking problem for MSO logic over finite binary relational structures, is fixed-parameter tractable (FPT) where the parameter consists of the formula that expresses the property and the tree-width or the clique-width of the input graph or structure. How to build usable algorithms for this problem? The pro...
متن کاملParallel Explicit Model Checking for Generalized Büchi Automata
We present new parallel emptiness checks for LTL model checking. Unlike existing parallel emptiness checks, these are based on an SCC enumeration, support generalized Büchi acceptance, and require no synchronization points nor repair procedures. A salient feature of our algorithms is the use of a global union-find data structure in which multiple threads share structural information about the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2019
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-019-00508-4